Structural Holes in Social Networks with Exogenous Cliques
نویسندگان
چکیده
منابع مشابه
Structural Holes in Social Networks with Exogenous Cliques
It has been empirically shown that structural holes in social networks enable potential large benefits to those individuals who bridge them (Burt, 2004). The work in Goyal and Vega-Redondo (2007) shows that the large payoff differentials caused by structural holes can persist even when agents strategically add and remove ties to smooth those differentials, thereby providing a game-theoretic rat...
متن کاملStructural holes in social networks
We consider a setting where every pair of players that undertake a transaction (e.g. exchange goods or information) create a unit surplus. A transaction can take place only if the players involved have a connection. If the connection is direct the two players split the surplus equally while if it is indirect then intermediate players also get an equal share of the surplus. Thus individuals form...
متن کاملReconstructing Archaeological Networks with Structural Holes
Model-based reconstruction is an approach to infer network structures where they cannot be observed. For archaeological networks, several models based on assumptions concerning distance among sites, site size, or costs and benefits have been proposed to infer missing ties. Since these assumptions are formulated at a dyadic level, they do not provide means to express dependencies among ties and ...
متن کاملExploiting the Formation of Maximal Cliques in Social Networks
In social networking analysis, there exists a fundamental problem called maximal cliques enumeration(MCE), which has been extensively investigated in many fields, including social networks, biological science, etc. As a matter of fact, the formation principle of maximal cliques that can help us to speed up the detection of maximal cliques from social networks is often ignored by most existing r...
متن کاملFinding All Maximal Cliques in Very Large Social Networks
The detection of communities in social networks is a challenging task. A rigorous way to model communities considers maximal cliques, that is, maximal subgraphs in which each pair of nodes is connected by an edge. State-of-the-art strategies for finding maximal cliques in very large networks decompose the network in blocks and then perform a distributed computation. These approaches exhibit a t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Games
سال: 2017
ISSN: 2073-4336
DOI: 10.3390/g8030032